Composite Shaft Optimization Using Simulated Annealing, Part I: Natural Frequency
نویسندگان
چکیده
منابع مشابه
Web newspaper layout optimization using simulated annealing
The Web newspaper pagination problem consists of optimizing the layout of a set of articles extracted from several Web newspapers and sending it to the user as the result of a previous query. This layout should be organized in columns, as in real newspapers, and should be adapted to the client Web browser configuration in real time. This paper presents an approach to the problem based on simula...
متن کاملOptimization by simulated annealing.
There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very ...
متن کاملFormation of Poly(vinylidenefluoride) Nanofibers: Part I Optimization by Using of Central Composite Design
Poly(vinylidene fluoride) (PVDF) nanofibers were prepared via electrospinning process. Several different factors influence on this process and application of experimental design for its optimization is of great importance. The central composite design (CCD) was used for planning and optimizing of the experiments and also, the analysis of variance (ANOVA) was employed for the statistical va...
متن کاملOptimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
0030-364X/89/3706·0865 $01.25 © 1989 Operations Research Society of America new problems (even in the absence of deep insight into the problems themselves) and, because of its apparent ability to avoid poor local optima, it offers hope of obtaining significantly better results. These observations, together with the intellectual appeal of the underlying physical analogy, have inspired articles i...
متن کاملSimulated Annealing and Global Optimization
Nelder-Mead (when you don’t know ∇f ) and steepest descent/conjugate gradient (when you do). Both of these methods are based on attempting to generate a sequence of positions xk with monotonically decreasing f(xk) in the hopes that the xk → x∗, the global minimum for f . If f is a convex function (this happens surprisingly often), and has only one local minimum, these methods are exactly the ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Rotating Machinery
سال: 2002
ISSN: 1023-621X
DOI: 10.1155/s1023621x02000258